package com.linwen.excise.leetcode;

/**
 * @author : linwen
 * @date : 下午5:28 2021/4/3
 */
public class _1143最长公共子序列 {
    public static void main(String[] args) {
        String s1 = "abcde";
        String s2 = "ace";
        int i = _1143最长公共子序列.longestCommonSubsequence(s1, s2);
        System.out.println(i);
    }
    public static int longestCommonSubsequence(String text1, String text2) {
        int m = text1.length();
        int n = text2.length();
        int[][] dp = new int[m+1][n+1];
        for (int i = 0; i < n; i++) {
            dp[0][i] = 0;
        }
        for (int i = 0; i < m; i++) {
            dp[i][0] = 0;
        }
        for (int i = 1; i <= m; i++) {
            char mc = text1.charAt(i-1);
            for(int j=1;j<=n;j++){
                char nc = text2.charAt(j-1);
                if(mc==nc){
                    dp[i][j] = dp[i-1][j-1]+1;
                }else{
                    dp[i][j] = Math.max(dp[i-1][j],dp[i][j-1]);
                }
            }
        }
        return dp[m][n];
    }
}




